首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   324553篇
  免费   6901篇
  国内免费   3574篇
化学   179776篇
晶体学   3791篇
力学   13607篇
综合类   263篇
数学   37791篇
物理学   99800篇
  2021年   2101篇
  2020年   2555篇
  2019年   2567篇
  2018年   2471篇
  2017年   2363篇
  2016年   4605篇
  2015年   4018篇
  2014年   5256篇
  2013年   15098篇
  2012年   11978篇
  2011年   14707篇
  2010年   9237篇
  2009年   9236篇
  2008年   13382篇
  2007年   13494篇
  2006年   13110篇
  2005年   11964篇
  2004年   10668篇
  2003年   9415篇
  2002年   9300篇
  2001年   10556篇
  2000年   8109篇
  1999年   6421篇
  1998年   5082篇
  1997年   4809篇
  1996年   4450篇
  1995年   4366篇
  1994年   4109篇
  1993年   3921篇
  1992年   4370篇
  1991年   4233篇
  1990年   3923篇
  1989年   3753篇
  1988年   4044篇
  1987年   3701篇
  1986年   3616篇
  1985年   5265篇
  1984年   5335篇
  1983年   4308篇
  1982年   4679篇
  1981年   4734篇
  1980年   4470篇
  1979年   4612篇
  1978年   4612篇
  1977年   4590篇
  1976年   4560篇
  1975年   4453篇
  1974年   4319篇
  1973年   4490篇
  1972年   2533篇
排序方式: 共有10000条查询结果,搜索用时 109 毫秒
31.
32.
33.
34.
Profiling engineered data with robust mining methods continues attracting attention in knowledge engineering systems. The purpose of this article is to propose a simple technique that deals with non-linear multi-factorial multi-characteristic screening suitable for knowledge discovery studies. The method is designed to proactively seek and quantify significant information content in engineered mini-datasets. This is achieved by deploying replicated fractional-factorial sampling schemes. Compiled multi-response data are converted to a single master-response effectuated by a series of distribution-free transformations and multi-compressed data fusions. The resulting amalgamated master response is deciphered by non-linear multi-factorial stealth stochastics intended for saturated schemes. The stealth properties of our method target processing datasets which might be overwhelmed by a lack of knowledge about the nature of reference distributions at play. Stealth features are triggered to overcome restrictions regarding the data normality conformance, the effect sparsity assumption and the inherent collapse of the ‘unexplainable error’ connotation in saturated arrays. The technique is showcased by profiling four ordinary controlling factors that influence webpage content performance by collecting data from a commercial browser monitoring service on a large scale web host. The examined effects are: (1) the number of Cascading Style Sheets files, (2) the number of JavaScript files, (3) the number of Image files, and (4) the Domain Name System Aliasing. The webpage performance level was screened against three popular characteristics: (1) the time to first visual, (2) the total loading time, and (3) the customer satisfaction. Our robust multi-response data mining technique is elucidated for a ten-replicate run study dictated by an L9(34) orthogonal array scheme where any uncontrolled noise embedded contribution has not been necessarily excluded.  相似文献   
35.
Incorporation of a non-hexagonal ring into a nanographene framework can lead to new electronic properties. During the attempted synthesis of naphthalene-bridged double [6]helicene and heptagon-containing nanographene by the Scholl reaction, an unexpected azulene-embedded nanographene and its triflyloxylated product were obtained, as confirmed by X-ray crystallographic analysis and 2D NMR spectroscopy. A 5/7/7/5 ring-fused substructure containing two formal azulene units is formed, but only one of them shows an azulene-like electronic structure. The formation of this unique structure is explained by arenium ion mediated 1,2-phenyl migration and a naphthalene to azulene rearrangement reaction according to an in-silico study. This report represents the first experimental example of the thermodynamically unfavorable naphthalene to azulene rearrangement and may lead to new azulene-based molecular materials.  相似文献   
36.
37.
38.
39.
40.
A (di)graph is supereulerian if it contains a spanning eulerian sub(di)graph. This property is a relaxation of hamiltonicity. Inspired by this analogy with hamiltonian cycles and by similar results in supereulerian graph theory, we analyze a number of sufficient Ore type conditions for a digraph to be supereulerian. Furthermore, we study the following conjecture due to Thomassé and the first author: if the arc‐connectivity of a digraph is not smaller than its independence number, then the digraph is supereulerian. As a support for this conjecture we prove it for digraphs that are semicomplete multipartite or quasitransitive and verify the analogous statement for undirected graphs.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号